Solving SAT in Linear Time with a Neural-Like Membrane System
نویسندگان
چکیده
We present in this paper a neural-like membrane system solving the SAT problem in linear time. These neural P systems are nets of cells working with multisets. Each cell has a finite state memory, processes multisets of symbol-impulses, and can send impulses ("excitations" ) to the neighboring cells. The maximal mode of rules application and the replicative mode of communication between cells are at the core of the efficiency of these systems.
منابع مشابه
On the convergence speed of artificial neural networks in the solving of linear systems
Artificial neural networks have the advantages such as learning, adaptation, fault-tolerance, parallelism and generalization. This paper is a scrutiny on the application of diverse learning methods in speed of convergence in neural networks. For this aim, first we introduce a perceptron method based on artificial neural networks which has been applied for solving a non-singula...
متن کاملSolving Subset Sum Problems by Time-free Spiking Neural P Systems
In membrane computing, spiking neural P systems (shortly called SN P systems) are a group of neural-like computing models inspired from the way spiking neurons communication in form of spikes. In previous works, SN P systems working in a nondeterministic manner have been used to solve numerical NP-complete problems, such as SAT, vertex cover, in feasible time. In these works, the application of...
متن کاملSolving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks
Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. In this paper, to solve this problem, we combine a discretization method and a neural network method. By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem. Then, we use...
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملSolving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes
P systems are parallel molecular computing models based on processing multisets of objects in cell-like membrane structures. Recently, Petr Sosı́k has shown that a semi-uniform family of P systems with active membranes and 2-division is able to solve the PSPACE-complete problem QBF-SAT in linear time; he has also conjectured that the membrane dissolving rules of the (d) type may be omitted, but ...
متن کامل